Placement of cuts in Padé-like approximation

On Padé Approximation of Some Practical Functions

Robust Padé Approximation via SVD

Padé approximation is considered from the point of view of robust methods of numerical linear algebra, in particular the singular value decomposition. This leads to an algorithm for practical computation that bypasses most problems of solution of nearly-singular systems and spurious pole-zero pairs caused by rounding errors; a Matlab code is provided. The success of this algorithm suggests that...

on padé approximation of some practical functions

0

Time Stepping Via One-Dimensional Padé Approximation

The numerical solution of time-dependent ordinary and partial differential equations presents a number of well known difficulties—including, possibly, severe restrictions on time-step sizes for stability in explicit procedures, as well as need for solution of challenging, generally nonlinear systems of equations in implicit schemes. In this note we introduce a novel class of explicit methods ba...

Gröbner bases and generalized Padé approximation

It is shown how to find general multivariate Padé approximation using the Gröbner basis technique. This method is more flexible than previous approaches, and several examples are given to illustrate this advantage. When the number of variables is small compared to the degree of approximation, the Gröbner basis technique is more efficient than the linear algebra methods in the literature.